A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph
نویسندگان
چکیده
منابع مشابه
A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem
Self-stabilization is a theoretical framework of nonmasking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a selfstabilizing heuristic solution to the problem. Our algorithm is constructed by four layered modules (sub-algorithms): construction of a shortest path forest, transformation of the network, construction...
متن کاملComputer Science Technical Report A Self-Stabilizing Distributed Algorithm to Construct An Arbitrary Spanning Tree of a Connected Graph
We propose a simple self-stabilizing distributed algorithm that maintains an arbitrary spanning tree in a connected graph. In proving the correctness of the algorithm we develop a new technique without using a bounded function (which is customary for proving correctness of self-stabilizing algorithms); the new approach is simple and can be potentially applied to proving correctness of other sel...
متن کاملA Self-Stabilizing Distributed Algorithm to Construct BFS Spanning Trees of a Symmetric Graph
We propose a simple and eecient self-stabilizing distributed algorithm to construct the breadth rst search (BFS) spanning tree of an arbitrary connected symmetric graph. We develop a completely new direct approach of graph theoretical reasoning to prove the correctness of our algorithm. The approach seems to have potential to have applications in proving correctness of other self-stabilizing al...
متن کاملA distributed self-stabilizing algorithm for argumentation
We propose a distributed approach to argumentation in which arguments are constructed by asynchronous processes which compute their own defeat status on the basis of local information. We present a self-stabilizing algorithm for the computation of defeat status, along with a proof of its correctness. The proposed approach introduces a remarkable flexibility in the management of argumentation ac...
متن کاملDistributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction
Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove its correctness. The algorithm utilizes an interesting result of [MP88]. We show the correctness o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1999
ISSN: 0022-0000
DOI: 10.1006/jcss.1998.1606